Mixed-Integer Nonlinear Programming (MINLP) for production optimisation of naturally flowing and artificial lift wells with routing constraints
نویسندگان
چکیده
منابع مشابه
Mixed integer programming with a class of nonlinear convex constraints
We study solution approaches to a class of mixed-integer nonlinear programming problems that arise from recent developments in risk-averse stochastic optimization and contain second-order and p-order cone programming as special cases. We explore possible applications of some of the solution techniques that have been successfully used in mixed-integer conic programming and show how they can be g...
متن کاملMixed-Integer Nonlinear Programming
Recently, the area of Mixed Integer Nonlinear Programming (MINLP) has experienced tremendous growth and a flourish of research activity. In this article we will give a brief overview of past developments in the MINLP arena and discuss some of the future work that can foster the development of MINLP in general and, in particular, robust solver technology for the practical solution of problems.
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملMixed Integer Programming with Decomposition for Workforce Scheduling and Routing with Time-dependent Activities Constraints
We present a mixed integer programming decomposition approach to tackle workforce scheduling and routing problems (WSRP) that involve time-dependent activities constraints. The proposed method is called repeated decomposition with conflict repair (RDCR) and it consists of repeatedly applying a phase of problem decomposition and sub-problem solving, followed by a phase dedicated to conflict repa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemical Engineering Research and Design
سال: 2019
ISSN: 0263-8762
DOI: 10.1016/j.cherd.2019.09.042